A Fast Ray-Tracing Using Bounding Spheres and Frustum Rays for Dynamic Scene Rendering
نویسندگان
چکیده
منابع مشابه
Shallow Bounding Volume Hierarchies for Fast SIMD Ray Tracing of Incoherent Rays
Photorealistic image synthesis is a computationally demanding task that relies on ray tracing for the evaluation of integrals. Rendering time is dominated by tracing long paths that are very incoherent by construction. We therefore investigate the use of SIMD instructions to accelerate incoherent rays. SIMD is used in the hierarchy construction, the tree traversal and the leaf intersection. Thi...
متن کاملParallel Scene Splitting and Assigning for Fast Ray Tracing
Photorealistic rendering is very often used area in computer graphics. It is used to display human body in medicine, buildings in architecture and also in other areas of our life. For photorealistic rendering are very important powerful computer, than it is relative difficult on computing. To render a 3D object in computer graphics a high efficient computer is needed, which enable user to work ...
متن کاملParallel SAH k-D Tree Construction for Fast Dynamic Scene Ray Tracing
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations between rays and the primitives. The highest quality k-D tree can be obtained using greedy cost optimization based on a surface area heuristc (SAH). While the high quality enables very fast ray tracing times, a key drawb...
متن کاملRendering Large Scenes Using Parallel Ray Tracing
Ray tracing is a powerful technique to generate realistic images of 3D scenes. However, the rendering of complex scenes may easily exceed the processing and memory capabilities of a single workstation. Distributed processing offers a solution if the algorithm can be parallelised in an efficient way. In this paper a hybrid scheduling approach is presented that combines demand driven and data par...
متن کاملFast GPU ray tracing of dynamic meshes using geometry images
Using the GPU to accelerate ray tracing may seem like a natural decision due to the highly parallel nature of the problem. However, past attempts at a fully general GPU ray tracer have yielded poor performance compared to optimized CPU ray tracers. In this paper we instead focus on an algorithm for quick intersection of a single mesh on the GPU. The algorithm uses a threaded bounding volume hie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2010
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e93.d.891